Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое finitely computable - определение
GROUP G THAT HAS SOME FINITE GENERATING SET S SO THAT EVERY ELEMENT OF G CAN BE WRITTEN AS THE PRODUCT OF FINITELY MANY ELEMENTS OF THE FINITE SET S AND OF INVERSES OF SUCH ELEMENT
Finitely-generated group; Finitely-generated subgroup; Finitely generated groups; Finitely Generated Group; Finitely generated subgroup
![The six 6th complex roots of unity form a [[cyclic group]] under multiplication.](https://commons.wikimedia.org/wiki/Special:FilePath/Cyclic group.svg?width=200 "The six 6th complex roots of unity form a [[cyclic group]] under multiplication.")
Найдено результатов: 63
Computable number
![π]] can be computed to arbitrary precision, while [[almost every]] real number is not computable.](https://commons.wikimedia.org/wiki/Special:FilePath/10,000 digits of pi - poster.svg?width=200 "π]] can be computed to arbitrary precision, while [[almost every]] real number is not computable.")
REAL NUMBER THAT CAN BE COMPUTED TO WITHIN ANY DESIRED PRECISION BY A FINITE, TERMINATING ALGORITHM
Computable numbers; Recursive number; Recursive numbers; Uncomputable number; Non-computable numbers; Noncomputable number; Non-computable number; Computable real; Computable real number; Computable reals; Uncomputable numbers; Uncomputable real number
In mathematics, computable numbers are the real numbers that can be computed to within any desired precision by a finite, terminating algorithm. They are also known as the recursive numbers, effective numbers or the computable reals or recursive reals.
Incomputable
BASIC OBJECTS OF STUDY IN COMPUTABILITY THEORY
Non-computable function; Total computable function; Partial computable function; Computable predicate; Incomputable; Effectively computable; Turing computable; Uncomputable function; Incomputable function; Noncomputable function; Provably total; Turing-computable; Uncomputable
·adj Not computable.
Computable function
BASIC OBJECTS OF STUDY IN COMPUTABILITY THEORY
Non-computable function; Total computable function; Partial computable function; Computable predicate; Incomputable; Effectively computable; Turing computable; Uncomputable function; Incomputable function; Noncomputable function; Provably total; Turing-computable; Uncomputable
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithms, in the sense that a function is computable if there exists an algorithm that can do the job of the function, i.
incomputable
BASIC OBJECTS OF STUDY IN COMPUTABILITY THEORY
Non-computable function; Total computable function; Partial computable function; Computable predicate; Incomputable; Effectively computable; Turing computable; Uncomputable function; Incomputable function; Noncomputable function; Provably total; Turing-computable; Uncomputable
a.
Not to be computed, that cannot be computed, incalculable, past calculation, beyond estimate, enormous, immense, prodigious, innumerable.
incomputable
BASIC OBJECTS OF STUDY IN COMPUTABILITY THEORY
Non-computable function; Total computable function; Partial computable function; Computable predicate; Incomputable; Effectively computable; Turing computable; Uncomputable function; Incomputable function; Noncomputable function; Provably total; Turing-computable; Uncomputable
¦ adjective rare unable to be calculated or estimated.
Finitely generated group
In algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combination (under the group operation) of finitely many elements of the finite set S and of inverses of such elements.
Content (measure theory)
EXTENDED-REAL-VALUED FUNCTION DEFINED ON A FIELD OF SETS THAT IS FINITELY ADDITIVE
Finitely additive measure
In mathematics, a content is a set function that is like a measure, but a content must only be finitely additive, whereas a measure must be countably additive. A content is a real function \mu defined on a collection of subsets \mathcal{A} such that
Finitely generated algebra
Finitely-generated algebra; Finitely generated ring; Algebra of finite type
In mathematics, a finitely generated algebra (also called an algebra of finite type) is a commutative associative algebra A over a field K where there exists a finite set of elements a1,...,an of A such that every element of A can be expressed as a polynomial in a1,...
Programming Computable Functions
TYPED FUNCTIONAL LANGUAGE
Programming language for Computable Functions; Programming with Computable Functions
In computer science, Programming Computable Functions (PCF) is a typed functional language introduced by Gordon Plotkin in 1977, based on previous unpublished material by Dana Scott. Programming Computable Functions is used by .
Finitely generated module
IN ALGEBRA, A MODULE THAT HAS A FINITE GENERATING SET
Finitely-presented module; Finitely presented module; Coherent module; Finitely cogenerated module; Finite module; Finitely related module; Finitely-related module; Finitely-generated module; Module of finite type; Rank of a module
In mathematics, a finitely generated module is a module that has a finite generating set. A finitely generated module over a ring R may also be called a finite R-module, finite over R,For example, Matsumura uses this terminology.
Википедия
Finitely generated group
In algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combination (under the group operation) of finitely many elements of S and of inverses of such elements.
By definition, every finite group is finitely generated, since S can be taken to be G itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated.
